User loginNavigation |
HOPL-III: Modula-2 and OberonNiklaus Wirth discusses two of his Pascal successor languages in the HOPL-III paper on Modula-2 and Oberon. This is an account of the development of the languages Modula-2 and Oberon. Together with their ancestors ALGOL 60 and Pascal they form a family called Algol-like languages. Pascal (1970) reflected the ideas of Structured Programming, Modula-2 (1979) added those of modular system design, and Oberon (1988) catered to the object-oriented style. Thus they mirror the essential programming paradigms of the past decades. Here the major language properties are outlined, followed by an account of the respective implementation efforts. The conditions and the environments are elucidated, in which the languages were created. We point out that simplicity of design was the most essential, guiding principle. Clarity of concepts, economy of features, efficiency and reliability of implementations were its consequences.The main influence on these languages were the Xerox Parc languages of Mesa and Cedar (which were Pascal derivatives). Mesa and Modula-2 explored modules, while Cedar and Oberon were concerned with the entire operating system experience. As Wirth states a couple of times in the paper, his main goal was to teach programming concepts, using language design to further that end, but with an eye for use in non-academic settings. He frowns on the design of modern PLs, with its lack of resource constraints and kitchen-sink approaches - expressing concern that it makes it hard to teach structured programming. He also expresses concern that operating systems are no longer a subject of research, much less integration with PL design. Designing High-Security Systems: A Comparison of Programming LanguagesDesigning High-Security Systems: A Comparison of Programming Languages. Ben Brosgol. STSC.
Not overly technical, but a useful summary none the less. By Ehud Lamm at 2007-07-05 10:56 | Software Engineering | login or register to post comments | other blogs | 6959 reads
Registration for the 10th ICFP Programming Contest is openRegistration for the 10th ICFP Programming Contest is now open. You can register via the homepage of the contest: -- The organisation team By Stefan Holdermans at 2007-07-02 11:55 | LtU Forum | login or register to post comments | other blogs | 6497 reads
CLL: A Concurrent Language Built from Logical Principles
CLL: A Concurrent Language Built from Logical Principles by Deepak Garg, 2005.
In this report, we use both the Curry-Howard isomorphism and proof-search to design a concurrent programming language from logical principles. ... Our underlying logic is a first-order intuitionistic linear logic where all right synchronous connectives are restricted to a monad.Yet another example of using monads to embed effectful computations into a pure FP. Another interesting part is the methodology of derivation of a PL from a logic. By Andris Birkmanis at 2007-06-30 18:06 | Logic/Declarative | Semantics | Type Theory | 2 comments | other blogs | 12729 reads
CMU AI repositoryThe Artificial Intelligence Repository was established by Mark Kantrowitz in 1993 to collect files, programs and publications of interest to Artificial Intelligence researchers, educators, and students. It is an outgrowth of the Lisp Utilities Repository established by Mark in 1990 and his work on the FAQ (Frequently Asked Questions) postings for the AI, Lisp, Scheme, and Prolog newsgroups. The Lisp Utilities Repository has been merged into the AI Repository.The CMU AI repository is a treasure trove of interesting source code. Here you'll find the Yale Haskell System, a *Lisp simulator for Connection Machine programming, obscure mailing-list archives, and God knows what else. Leave a comment if you find anything particularly interesting in here :-) Thinking Forth & Starting ForthLeo Brodie's books Thinking Forth and Starting Forth are now available for download and the first is back in print. This material had been hard to find for a long time! Haskell web storeUntil yesterday, I wasn't aware of any web stores implemented in Haskell. Most users of languages like Haskell and ML tend to be focused on other kinds of applications. This sometimes leads to discussions about the "real-world suitability" of these languages, which we've occasionally seen here on LtU. The next time the subject comes up, it will be possible to point to a real, complete web store written in Haskell, which was announced on Haskell-Cafe back in April. The store is Braintree Hemp, and the code behind it was written by Adam Peacock. It's an impressive program, written in a little over 4200 lines of Haskell, sporting the following features: By Anton van Straaten at 2007-06-28 21:51 | Functional | 16 comments | other blogs | read more | 25485 reads
Singularity: Rethinking the Software StackSingularity: Rethinking the Software Stack.
Singularity comes up in discussion every now and then. This seems like a nice and recent overview. Pirahã living-in-the-present language
Light reading from The New Yorker - April 16, 2007 about LtU's favourite amazonian tribe (previously on LtU Piraha Exceptionality: a Reassessment). HOT PicklesAlice ML team members Andreas Rossberg, Guido Tack & Leif Kornstaedt write about the implications of pickling for higher-order-type systems in their latest paper on HOT Pickles ...and how to serve them. The paper makes the point that pickling should be considered an important aspect for programming language design. By making pickles first class, a number of related problems in open programming (serialization, distribution, modularity) can be directly addressed. |
Browse archives
Active forum topics |
Recent comments
2 weeks 3 days ago
2 weeks 4 days ago
2 weeks 5 days ago
2 weeks 5 days ago
3 weeks 3 days ago
3 weeks 3 days ago
3 weeks 3 days ago
6 weeks 4 days ago
7 weeks 2 days ago
7 weeks 3 days ago